Functional RuleML: From Horn Logic with Equality to Lambda Calculus∗
نویسنده
چکیده
Functions are introduced to RuleML via orthogonal dimensions “constructor vs. userdefined”, “singlevs. set-valued”, “firstvs. higher-order”. This enables functionallogic programming for the Semantic Web. ∗Thanks to David Hirtle, Duong Dai Doan, and Thuy Thi Thu Le for helpful discussions and for improving the DTD. This research was partially supported by NSERC.
منابع مشابه
Distributed reasoning with ontologies and rules in order-sorted logic programming
Integrating ontologies and rules on the Semantic Web enables software agents to interoperate between them; however, this leads to two problems. First, reasoning services in SWRL (a combination of OWL and RuleML) are not decidable. Second, no studies have focused on distributed reasoning services for integrating ontologies and rules in multiple knowledge bases. In order to address these problems...
متن کاملLOG(F): An Optimal Combination of Logic Programming, Rewriting and Lazy Evaluation
-A new approach for combining logic programming, rewriting, and lazy evaluation is described. It rests upon subsuming within logic programming, instead of upon extending it with, rewriting, and lazy evaluation. A non-terminating, non-deterministic rewrite rule system, F* and a reduction strategy for it, select, are defined. F* is shown to be reduction-complete in that select simplifies terms wh...
متن کاملTerm Sequent Logic
We consider a term sequent logic for the lambda-calculus. Term sequents are a judgement form similar to the logical judgement form of entailment between sentences, but denoting equality or reducibility between terms. Using term sequents, it is possible to treat lambda-terms almost like logical sentences, and to use proof-theoretic methods to establish their properties. We prove a cut-eliminatio...
متن کاملThe Blossom of Finite Semantic Trees
Automated deduction in first-order logic finds almost all its roots in Herbrand’s work, starting with Herbrand’s interpretations, a clausal calculus, and rules for unification. J.A. Robinson’s key contribution was the formulation of resolution and its completeness proof, in which semantic trees were semi-apparent. Robinson and Wos introduced the specific treatment of equality commonly called pa...
متن کاملExtensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کامل